Commuting Polynomial Operations of Distributive Lattices
نویسندگان
چکیده
We describe which pairs of distributive lattice polynomial operations commute.
منابع مشابه
Distributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملDistributive Lattices with a given Skeleton
We present a construction of finite distributive lattices with a given skeleton. In the case of an H-irreducible skeleton K the construction provides all finite distributive lattices based on K, in particular the minimal one.
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملTree Structure for Distributive Lattices and its Applications
From a well-known decomposition theorem, we propose a tree representation for distributive and simplicial lattices. We show how this representation (called ideal tree) can be efficiently computed (linear time in the size of the lattice given by any graph whose transitive closure is the lattice) and compared with respect to time and space complexity. As far as time complexity is concerned, we si...
متن کاملThe Structure of Pseudocomplemented Distributive Lattices. I: Subdirect Decomposition
In this paper all subdirectly irreducible pseudocomplemented distributive lattices are found. This result is used to establish a Stone-like representation theorem conjectured by G. Grätzer and to find all equational subclasses of the class of pseudocomplemented distributive lattices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 29 شماره
صفحات -
تاریخ انتشار 2012